class Bonus {
public:
    int getMost(vector<vector<int> > board) {
        if(board.empty())
            return 0;
        //初始化边界
        for(int i=1;i<6;i++)
        {
            board[0][i]+=board[0][i-1];
            board[i][0]+=board[i-1][0];
        }
        for(int i=1;i<6;i++)
        {
            for(int j=1;j<6;j++)
            {
                board[i][j]=board[i][j]+max(board[i-1][j],board[i][j-1]);
            }
        }
        //返回右下角
        return board[5][5];
    }
};